Prescribing the binary digits of primes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Prescribing the Binary Digits of Primes

We present a new result on counting primes p < N = 2 for which r (arbitrarily placed) digits in the binary expansion of p are specified. Compared with earlier work of Harman and Katai, the restriction on r is relaxed to r < c ( n log n )4/7 . This condition results from the estimates of Gallagher and Iwaniec on zero-free regions of L-functions with ‘powerful’ conductor. (0). Summary This work i...

متن کامل

Primes with an Average Sum of Digits

The main goal of this paper is to provide asymptotic expansions for the numbers #{p 6 x : p prime, sq(p) = k} for k close to ((q − 1)/2) logq x, where sq(n) denotes the q-ary sum-of-digits function. The proof is based on a thorough analysis of exponential sums of the form ∑ p6x e(αsq(p)) (the sum is restricted to p prime), where we have to extend a recent result by the second two authors.

متن کامل

The sum of digits of primes in Z[i]

We study the distribution of the complex sum-of-digits function sq with basis q = −a ± i, a ∈ Z+ for Gaussian primes p. Inspired by a recent result of Mauduit and Rivat [16] for the real sum-of-digits function, we here get uniform distribution modulo 1 of the sequence (αsq(p)) provided α ∈ R \Q and q is prime with a ≥ 28. We also determine the order of magnitude of the number of Gaussian primes...

متن کامل

Counting Primes whose Sum of Digits is Prime

Motivated by recent work of Drmota, Mauduit and Rivat, we discuss the possibility of counting the number of primes up to x whose sum of digits is also prime. We show that, although this is not possible unless we assume a hypothesis on the distribution of primes stronger than what is implied by the Riemann hypothesis, we can establish a Mertens-type result. That is, we obtain a formula for the n...

متن کامل

On Binary Representations of Integers with Digits

Güntzer and Paul introduced a number system with base 2 and digits −1, 0, 1 which is characterized by separating nonzero digits by at least one zero. We find an explicit formula that produces the digits of the expansion of an integer n which leads us to many generalized situations. Syntactical properties of such representations are also discussed. 1. A binary number system Integers n can be wri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Israel Journal of Mathematics

سال: 2012

ISSN: 0021-2172,1565-8511

DOI: 10.1007/s11856-012-0104-2